coprime integers

См. также в других словарях:

• Coprime — In number theory, a branch of mathematics, two integers a and b are said to be coprime (also spelled co prime) or relatively prime if the only positive integer that evenly divides both of them is 1. This is the same thing as their greatest common …   Wikipedia

• coprime — adjective a) Having no positive integer factors in common, aside from 1. 24 and 35 are coprime. b) Having no positive integer factors, aside from 1, in common with one or more specified other positive integers. 24 is coprime to 35. Syn: relativ …   Wiktionary

• Pairwise coprime — In mathematics, especially number theory, a set of integers is said to be pairwise coprime (or pairwise relatively prime, also known as mutually coprime) if every pair of integers a and b in the set are coprime (that is, have no common divisors… …   Wikipedia

• Multiplicative group of integers modulo n — In modular arithmetic the set of congruence classes relatively prime to the modulus n form a group under multiplication called the multiplicative group of integers modulo n. It is also called the group of primitive residue classes modulo n. In… …   Wikipedia

• abc conjecture — The abc conjecture (also known as Oesterlé–Masser conjecture) is a conjecture in number theory, first proposed by Joseph Oesterlé and David Masser in 1985. The conjecture is stated in terms of three positive integers, a, b and c (whence comes the …   Wikipedia

• Square root of 2 — The square root of 2, also known as Pythagoras constant, often denoted by:sqrt{2} or √2but can also be written as:2^{1/2},,is the positive real number that, when multiplied by itself, gives the number 2. Its numerical value approximated to 65… …   Wikipedia

• List of topics named after Leonhard Euler — In mathematics and physics, there are a large number of topics named in honour of Leonhard Euler (pronounced Oiler ). As well, many of these topics include their own unique function, equation, formula, identity, number (single or sequence), or… …   Wikipedia

• Dirichlet's theorem on arithmetic progressions — In number theory, Dirichlet s theorem, also called the Dirichlet prime number theorem, states that for any two positive coprime integers a and d, there are infinitely many primes of the form a + nd, where n ≥ 0. In other… …   Wikipedia

• Constructions of low-discrepancy sequences — There are some standard constructions of low discrepancy sequences. Contents 1 The van der Corput sequence 2 The Halton sequence 3 The Hammersley set 4 References …   Wikipedia

• Apéry's theorem — In mathematics, Apéry s theorem is a result in number theory that states the number ζ(3) is irrational. That is, the number:zeta(3)=sum {n=1}^infty frac{1}{n^3}=frac{1}{1^3}+frac{1}{2^3}+frac{1}{3^3}+ldots = 1.2020569ldots cannot be written as a… …   Wikipedia

• Virasoro algebra — In mathematics, the Virasoro algebra (named after the physicist Miguel Angel Virasoro) is a complex Lie algebra, given as a central extension of the complex polynomial vector fields on the circle, and is widely used in string theory.DefinitionThe …   Wikipedia